منابع مشابه
Almost All Trees have an Even Number of Independent Sets
This paper is devoted to the proof of the surprising fact that almost all trees have an even number of independent vertex subsets (in the sense that the proportion of those trees with an odd number of independent sets tends to 0 as the number of vertices approaches ∞) and to its generalisation to other moduli: for fixed m, the probability that a randomly chosen tree on n vertices has a number o...
متن کاملThe Harmonious Chromatic Number of Almost All Trees
General rights Copyright and moral rights for the publications made accessible in Discovery Research Portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from Discovery Research Portal for th...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملAlmost All Friendly Matrices Have Many Obstructions
A symmetric m×m matrix M with entries taken from {0, 1, ∗} gives rise to a graph partition problem, asking whether a graph can be partitioned into m vertex sets matched to the rows (and corresponding columns) of M such that, if Mij = 1, then any two vertices between the corresponding vertex sets are joined by an edge, and if Mij = 0 then any two vertices between the corresponding vertex sets ar...
متن کاملCharacterizing all trees with locating-chromatic number 3
Let c be a proper k-coloring of a connected graph G. Let Π = {S1, S2, . . . , Sk} be the induced partition of V (G) by c, where Si is the partition class having all vertices with color i. The color code cΠ(v) of vertex v is the ordered k-tuple (d(v, S1), d(v, S2), . . . , d(v, Sk)), where d(v, Si) = min{d(v, x)|x ∈ Si}, for 1 ≤ i ≤ k. If all vertices of G have distinct color codes, then c is ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0013-t